Subquadratic Encodings for Point Configurations
نویسندگان
چکیده
For most algorithms dealing with sets of points in the plane, the only relevant information carried by the input is the combinatorial configuration of the points: the orientation of each triple of points in the set (clockwise, counterclockwise, or collinear). This information is called the order type of the point set. In the dual, realizable order types and abstract order types are combinatorial analogues of line arrangements and pseudoline arrangements. Too often in the literature we analyze algorithms in the real-RAM model for simplicity, putting aside the fact that computers as we know them cannot handle arbitrary real numbers without some sort of encoding. Encoding an order type by the integer coordinates of some realizing point set is known to yield doubly exponential coordinates in some cases. Other known encodings can achieve quadratic space or fast orientation queries, but not both. In this contribution, we give a compact encoding for abstract order types that allows efficient query of the orientation of any triple: the encoding uses O(n) bits and an orientation query takes O(logn) time in the word-RAM model. This encoding is space-optimal for abstract order types. We show how to shorten the encoding to O(n(log logn)/ logn) bits for realizable order types, giving the first subquadratic encoding for those order types with fast orientation queries. We further refine our encoding to attain O(logn/ log log n) query time without blowing up the space requirement. In the realizable case, we show that all those encodings can be computed efficiently. Finally, we generalize our results to the encoding of point configurations in higher dimension.
منابع مشابه
On the Difference Between Closest, Furthest, and Orthogonal Pairs: Nearly-Linear vs Barely-Subquadratic Complexity
Point location problems for n points in d-dimensional Euclidean space (and `p spaces more generally) have typically had two kinds of running-time solutions: (Nearly-Linear) less than d · n log n time, or (Barely-Subquadratic) f(d) ·n2−1/Θ(d) time, for various f . For small d and large n, “nearly-linear” running times are generally feasible, while the “barely-subquadratic” times are generally in...
متن کاملOn the Difference Between Closest, Furthest, and Orthogonal Pairs: Nearly-Linear vs Barely-Subquadratic Complexity in Computational Geometry
Point location problems for n points in d-dimensional Euclidean space (and lp spaces more generally) have typically had two kinds of running-time solutions: (Nearly-Linear) less than d ·n log n time, or (Barely-Subquadratic) f (d) ·n2−1/Θ(d) time, for various functions f . For small d and large n, “nearly-linear” running times are generally feasible, while the “barelysubquadratic” times are gen...
متن کاملApproximability of the Discrete Fréchet Distance
The Fréchet distance is a popular and widespread distance measure for point sequences and for curves. About two years ago, Agarwal et al [SIAM J. Comput. 2014] presented a new (mildly) subquadratic algorithm for the discrete version of the problem. This spawned a flurry of activity that has led to several new algorithms and lower bounds. In this paper, we study the approximability of the discre...
متن کاملSubquadratic Medial-axis Approximation in Ir
We present an algorithm that approximates the medial axis of a smooth surface in IR which is given by a sufficiently dense point sample. The resulting, non-discrete approximation is shown to converge to the medial axis as the sampling density approaches infinity. While all previous algorithms guaranteeing convergence have a running time quadratic in the size n of the point sample, we achieve a ...
متن کاملApproximating Dynamic Time Warping and Edit Distance for a Pair of Point Sequences
We present the first subquadratic algorithms for computing similarity between a pair of point sequences in R, for any fixed d > 1, using dynamic time warping (DTW) and edit distance, assuming that the point sequences are drawn from certain natural families of curves. In particular, our algorithms compute (1 + ε)-approximations of DTW and ED in near-linear time for point sequences drawn from κ-p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1801.01767 شماره
صفحات -
تاریخ انتشار 2018